Fault-diameter of the star-connected cycles interconnection network

Lel G be a graph with vertex connectivi2y k(G). An important measure of the fault tolerance of G is its faul&diameler df(G), which is defined as the maximum diameter resulting from the deletion of any set of nodes containing less than k(G) nodes. The robustness of G is often measured by comparing d/(G) with the diameter of Ihe fault-free G, namely d(G). In particular, a family of graphs G, is dubbed strongly resilient if df(G”) 5 d(Gn) + c, where c is a fixed constant independent of n. This paper derives the fault-diameter of Ihe starconnected cycles (SCC) inlerconnection network. We show that the SCC,, graph is strongly resilient, exhibiting a fault-diameter of df(SCC3) = d(SCC3) + 4, df (SC&) = d( SCC,)+S, and df (SCC,,) = d( SC&)+ 1, for n > 5.